منابع مشابه
Sublinearly Space Bounded Iterative Arrays
Iterative arntys (lAs) are a, parallel computational model with a, sequential processing of the input. They are one-dimensional arrays of interacting identical deterministic finite automata. In this note, realtime-lAs with sublinear space bounds are used to accept formal languages. The existence of a proper hierarchy of space complexity classes between logarithmic anel linear space bounds is pr...
متن کاملBounded Broadcast in Systolic Arrays
Much work has been done on the problem of synthesizing a processor array from a system of recurrence equations. Some researchers limit communication to nearest neighbors in the array; others use broadcast. In many cases, neither of the above approaches result in an optimal execution time. In this paper a technique called bounded broadcast is explored whereby an element of a processor array can ...
متن کاملDesign of Diagnosable Iterative Arrays
Oneand two-dimensional iterative arrays of identical cells are becoming more important in the design of digital systems using large-scale integrated circuits because of the advantages that they provide in design, fabrication, and testing. Since arrays containing hundreds or thousands of gates on one chip are now considered possible, the task of finding procedures for the testing of such arrays ...
متن کاملSpace-Bounded Query Approximation
When dealing with large amounts of data, exact query answering is not always feasible. We propose a query approximation method that, given an upper bound on the amount of data that can be used (i.e., for which query evaluation is still feasible), identifies a part C of the data D that (i) fits in the available space budget; and (ii) provides accurate query results. That is, for a given query Q,...
متن کاملSpace-Bounded Kolmogorov Extractors
An extractor is a function that receives some randomness and either “improves” it or produces “new” randomness. There are statistical and algorithmical specifications of this notion. We study an algorithmical one called Kolmogorov extractors and modify it to resourcebounded version of Kolmogorov complexity. Following Zimand we prove the existence of such objects with certain parameters. The uti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2010
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054110007581